Truth degree of intuitionistic fuzzy propositional logic formula 直觉模糊命题逻辑公式的真度
Theory of truth degree based on the finite interpretation and enumerable interpretation of fuzzy predicate logic formulas 模糊谓词逻辑公式的有限和可数解释真度理论
It can be used to validate the unsatisfiability and satisfiability of propositional logic formulae quickly 这种方法可以对逻辑公式的原始形态直接进行计算,无需化简。
Theory of truth degree of first - order fuzzy predicate logics formulas based on the finite interpretation and enumerable interpretation and its application 一阶模糊谓词逻辑公式的有限解释真度和可数解释真度的理论及其应用
After - transforming the labeled transition system of operational semantics and linear temporal logic formula into btlchi automata respectively , the correctness of uml statecharts can be verified using automaton - based model checking method 在把根据eha操作语义得到的标记迁移系统和表示性质的线性时态逻辑公式分别转换为b chi自动机后,用基于自动机理论的模型检验方法验证umlstatecharts的正确性。